Tractable valuations under uncertainty
نویسندگان
چکیده
منابع مشابه
Tractable Planning under Uncertainty: Exploiting Structure
T HE problem of planning under uncertainty has received significant attention in the scientific community over the past few years. It is now well-recognized that considering uncertainty during planning and decision-making is imperative to the design of robust computer systems. This is particularly crucial in robotics, where the ability to interact effectively with real-world environments is a p...
متن کاملTractable Probabilistic Knowledge Bases with Existence Uncertainty
A central goal of AI is to reason efficiently in domains that are both complex and uncertain. Most attempts toward this end add probability to a tractable subset of first-order logic, but this results in intractable inference. To address this, Domingos and Webb (2012) introduced tractable Markov logic (TML), the first tractable first-order probabilistic representation. Despite its surprising ex...
متن کاملRobust load balancing under traffic uncertainty - tractable models and efficient algorithms
Routing configurations that have been optimized for a nominal traffic scenario often display significant performance degradation when they are subjected to real network traffic. These degradations are due to the inherent sensitivity of classical optimization techniques to changes in model parameters combined with the significant traffic variations caused by demand fluctuations, component failur...
متن کاملOptimal Bundling Strategies Under Heavy-Tailed Valuations
W develop a framework for the optimal bundling problem of a multiproduct monopolist, who provides goods to consumers with private valuations that are random draws from a distribution with heavy tails. We show that in the Vickrey auction setting, the buyers prefer separate provision of the goods to any bundles. We also provide a complete characterization of the optimal bundling strategies for a ...
متن کاملFixed-Parameter Tractable Optimization Under DNNF Constraints
Minimizing a cost function under a set of combinatorial constraints is a fundamental, yet challenging problem in AI. Fortunately, in various real-world applications, the set of constraints describing the problem structure is much less susceptible to change over time than the cost function capturing user’s preferences. In such situations, compiling the set of feasible solutions during an offline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economics Letters
سال: 2015
ISSN: 0165-1765
DOI: 10.1016/j.econlet.2014.11.016